Modification of Dijkstra’s Algorithm for Safest and Shortest Path during Emergency Evacuation
نویسنده
چکیده
Intelligent autonomous evacuation navigation (AEN) system manages to solve wayfinding problems during emergency evacuation, especially for those who are not familiar with the building. AEN system is expected to provide independent evacuation navigation through the dynamic signage, which helps occupants navigate to the safest and shortest path towards the nearest exit. It uses modified Dijkstra’s algorithm in order to incorporate both aspects and considering the hazardous location. Therefore, this paper presents the methodology used for the modification of Dijkstra’s algorithm to find the safest and shortest path. The first modification involved the restriction of floor plan node's direction; and the second modification was blocking the nodes that affected by fire. The example is presented to compare the result obtained using the modified algorithm. Thus, it 1532 Khyrina Airin Fariza Abu Samah et al. reveals the effectiveness of the modification in determining the best path for the evacuation process.
منابع مشابه
Routing Emergency Evacuees with Cognitive Packet Networks
Providing optimal and safe routes to evacuees in emergency situations requires fast and adaptive algorithms. The common approaches are often too slow to converge, too complex, or only focus on one aspect of the problem, e.g. finding the shortest path. This paper presents an adaptation of the Cognitive Packet Network (CPN) concept to emergency evacuation problems. Using Neural Networks, CPN is a...
متن کاملFinding the nearest facility for travel and waiting time in a transport network
One of user's queries from navigation service is to find the nearest facility in terms of time. The facility that is being questioned by the user as a destination may have a queuing service system (e.g. bank), which means that the cost function of the shortest path includes the waiting time at the destination as well as the travel time. This research conducts in the zone 1 of Mashhad with Bank ...
متن کاملDirectional Navigation Improves Opportunistic Communication for Emergencies
We present a novel direction based shortest path search algorithm to guide evacuees during an emergency. It uses opportunistic communications (oppcomms) with low-cost wearable mobile nodes that can exchange packets at close range of a few to some tens of meters without help of an infrastructure. The algorithm seeks the shortest path to exits which are safest with regard to a hazard, and is inte...
متن کاملOn the Crowded Places Multi-Exits Emergency Evacuation Model and Algorithm
Emergency evacuation in the crowed places was discussed, under the different analysis, description, and relevant research backgrounds. First, the evacuation shortest path optimization model was established. Then the optimization solution results obtained by using of software Lingo were analyzed and verified. Finally, the quantitative solution results were conversed to the version of variable, s...
متن کاملSafety of users in road evacuation: algorithms for path design of emergency vehicles
In this paper an advancement on the SICURO Research Project relating to the design of path choice models for emergency vehicles is proposed. In particular, with respect to the previous work in which the procedures to be planned and activated in emergency conditions were defined in order to allow the evacuation of weak users (the disabled, senior citizens, etc.) from the area affected by a disas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015